Data-adaptive Probability Plot and its Applications
نویسندگان
چکیده
منابع مشابه
Adaptive Technology and Its Applications
INTRODUCTION Before the advent of software engineering, the lack of memory space in computers and the absence of established programming methodologies led early programmers to use self-modification as a regular coding strategy. Although unavoidable and valuable for that class of software, solutions using self-modification proved inadequate while programs grew in size and complexity, and securit...
متن کاملExtended Recurrence Plot Analysis and its Application to ERP Data
We present new measures of complexity and their application to event related potential data. The new measures base on structures of recurrence plots and makes the identification of chaos-chaos transitions possible. The application of these measures to data from single-trials of the Oddball experiment can identify laminar states therein. This offers a new way of analyzing event-related activity ...
متن کاملFractional Probability Measure and Its Properties
Based on recent studies by Guy Jumarie [1] which defines probability density of fractional order and fractional moments by using fractional calculus (fractional derivatives and fractional integration), this study expands the concept of probability density of fractional order by defining the fractional probability measure, which leads to a fractional probability theory parallel to the classical ...
متن کاملAdaptive Data Partitioning Using Probability Distribution
Many computing problems benefit from dynamic data partitioning—dividing a large amount of data into smaller chunks with better locality. When data can be sorted, two methods are commonly used in partitioning. The first selects pivots, which enable balanced partitioning but cause a large overhead of up to half of the sorting time. The second method uses simple functions, which is fast but requir...
متن کاملAdaptive Data Partition Using Probability Distribution
Many computing problems benefit from dynamic partition of data into smaller chunks with better parallelism and locality. Previous partition methods either have high overhead or only apply to uniformly distributed data. This paper presents a new partition method in sorting scenario based on probability distribution, an idea first studied by Janus and Lamagna in early 1980’s on a mainframe comput...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Kodo Keiryogaku (The Japanese Journal of Behaviormetrics)
سال: 2002
ISSN: 0385-5481,1880-4705
DOI: 10.2333/jbhmk.29.103